Stochastic global maximum principle for optimization with recursive utilities
نویسندگان
چکیده
In this paper, we study the recursive stochastic optimal control problems. The control domain does not need to be convex, and the generator of the backward stochastic differential equation can contain z. We obtain the variational equations for backward stochastic differential equations, and then obtain the maximum principle which solves completely Peng’s open problem.
منابع مشابه
Maximum Principles of Markov Regime-Switching Forward-Backward Stochastic Differential Equations with Jumps and Partial Information
Résumé/Abstract: In this talk, we present three versions of maximum principle for a stochastic optimal control problem of Markov regime-switching forward-backward stochastic differential equations with jumps (FBSDEJs). A general sufficient maximum principle for optimal control for a system driven by a Markov regime-switching forward and backward jump-diffusion model is developed. After, an equi...
متن کاملA Maximum Principle for Stochastic Optimal Control with Terminal State Constraints, and Its Applications
This paper is concerned with a stochastic optimal control problem where the controlled system is described by a forward–backward stochastic differential equation (FBSDE), while the forward state is constrained in a convex set at the terminal time. An equivalent backward control problem is introduced. By using Ekeland’s variational principle, a stochastic maximum principle is obtained. Applicati...
متن کاملMaximization of Recursive Utilities: A Dynamic Maximum Principle Approach
In this paper we study a class of robust utility maximization problem over a terminal wealth and consumption in a complete market. Using the backward stochastic differential equation theory (BSDE in short), we derive a comparison theorem to give a dynamic maximum principle for the optimal control of our problem. We prove the existence and uniqueness of an optimal strategy and we characterize it...
متن کاملKnapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms ...
متن کاملOptimal Premium Policy of an Insurance Firm with Delay and Stochastic Interest Rate
In this paper, we study the optimization problem confronted by an insurance firm whose management can control its cash-balance dynamics by adjusting the underlying premium rate. The firm’s objective is to minimize the total deviation of its cash-balance process to some pre-set target levels by selecting an appropriate premium policy. We study the problem in a general framework assuming the stat...
متن کامل